On the P Λ Problem
نویسنده
چکیده
The well-known “H conjecture” (see [HaR]) states that n + 1 is prime infinitely many often. This is equivalent to the existence of infinitely many primes p satisfying {p1/2} < p. The current methods of analytic number theory are far from being sufficient to prove these conjectures. However, Kubilius [Kub] and Ankeny [Ank] proved already about fifty years ago that, assuming the truth of the Riemann Hypothesis for Hecke L-functions with Größencharacters over Q(i), p = n+m is infinitely many often prime withm ≪ log p. This implies that {
منابع مشابه
On Approximate Stationary Radial Solutions for a Class of Boundary Value Problems Arising in Epitaxial Growth Theory
In this paper, we consider a non-self-adjoint, singular, nonlinear fourth order boundary value problem which arises in the theory of epitaxial growth. It is possible to reduce the fourth order equation to a singular boundary value problem of second order given by w''-1/r w'=w^2/(2r^2 )+1/2 λ r^2. The problem depends on the parameter λ and admits multiple solutions. Therefore, it is difficult to...
متن کاملUnit commitment by a fast and new analytical non-iterative method using IPPD table and “λ-logic” algorithm
Many different methods have been presented to solve unit commitment (UC) problem in literature with different advantages and disadvantages. The need for multiple runs, huge computational burden and time, and poor convergence are some of the disadvantages, where are especially considerable in large scale systems. In this paper, a new analytical and non-iterative method is presented to solve UC p...
متن کاملConception de reseaux dynamiques . . .
In this paper we study a combinatorial optimization problem arising from on-board networks in satellites. In these kinds of networks the entering signals (inputs) should be routed to amplifiers (outputs). The connections are made via expensive switches with four available links. The paths connecting inputs to outputs should be link-disjoint. More formally, we call a (p, λ, k)−network an undirec...
متن کاملMinimal selectors and fault tolerant networks
In this paper we study a combinatorial optimization problem issued from on-board networks in satellites. In this kind of networks the entering signals (inputs) should be routed to amplifiers (outputs). The connections are made via expensive switches with four links available. The paths connecting inputs to outputs should be link-disjoint. More formally, we call (p, λ, k)−network an undirected g...
متن کاملOn the Absolute Sum of Chromatic Polynomial Coefficient of Graphs
For a century ago, one of the most famous problems in mathematics was to prove the FourColor Problem. During the period that the Four-Color Problem was unsolved, which spanned more than a century, many approaches were introduced with the hopes that they would lead to a solution of this famous problem. In 1913, Birkhoff 1 defined a function P M,λ that gives the number of proper λ-colorings of a ...
متن کاملKarlin’s Basic Composition Theorems and Stochastic Orderings
Suppose λ,x,ζ traverse the ordered sets Λ, X and Z, respectively and consider the functions f(λ,x,ζ) and g(λ,ζ) satisfying the following conditions, (a) f(λ,x,ζ) > 0 and f is TP2 in each pairs of variables when the third variable is held fixed and (b) g(λ,ζ) is TP2. Then the function h(λ,x) =∫Z f(λ,x,ζ)g(λ,ζ)dµ(ζ), defined on Λ×X is TP2 in (λ,x). The aim of this note is to use a new stochast...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008